SAU: Smooth Activation Function Using Convolution with Approximate Identities

نویسندگان

چکیده

AbstractWell-known activation functions like ReLU or Leaky are non-differentiable at the origin. Over years, many smooth approximations of have been proposed using various smoothing techniques. We propose new a function by convolving it with approximate identities. In particular, we present and show that they outperform several well-known in datasets models. call this Smooth Activation Unit (SAU). Replacing SAU, get 5.63%, 2.95%, 2.50% improvement ShuffleNet V2 (2.0x), PreActResNet 50 ResNet models respectively on CIFAR100 dataset 2.31% (1.0x) model ImageNet-1k dataset.KeywordsSmooth FunctionNeural Network

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate convolution using DCT coefficient multipliers

DCT-domain processing, filtering, convolution, image enhancement, quantization tables We develop a method for designing DCT coefficient multipliers in order to approximate the operation of 2D convolution of an image with a given kernel. The method is easy to implement on compressed formats of DCT-based compression methods (JPEG, MPEG, H.261) by applying decoding quantization tables that are inc...

متن کامل

Convolution Identities for Bernoulli and Genocchi Polynomials

The main purpose of this paper is to derive various Matiyasevich-Miki-Gessel type convolution identities for Bernoulli and Genocchi polynomials and numbers by applying some Euler type identities with two parameters.

متن کامل

Smooth Optimization with Approximate Gradient

We show that the optimal complexity of Nesterov’s smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs, this often means computing only a few dominant eigenvalues of the current iterate instead of a full matrix exponential, which significantly reduces the method’s...

متن کامل

Approximate Non-Stationary Convolution Using a Block Separable Matrix

Lens-based vision systems such as human eyes and cameras focus on one particular distance from the lens. The rest of a viewed image is out of focus with a degree which varies according to the distance from the object in focus. This is called depth of field. Computer generated images are most quickly and easily rendered entirely in perfect focus, causing them to appear unnatural and cluttered. M...

متن کامل

Approximate convolution with pairs of cubic Bézier LN curves

In this paper we present an approximation method for the convolution of two planar curves using a pair of two cubic Bézier curves with linear normals (LN). We characterize the necessary and sufficient conditions for two compatible cubic Bézier LN curves to have the same linear normal map. Using this characterization, we obtain the cubic spline approximation of the convolution curve. As illustra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-19803-8_19